Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts
نویسندگان
چکیده
The overhead of processing fine-grain tasks on a grid induces the need for batch processing or task group deployment in order to minimise overall application turnaround time. When deciding the granularity of a batch, the processing requirements of each task should be considered as well as the utilisation constraints of the interconnecting network and the designated resources. However, the dynamic nature of a grid requires the batch size to be adaptable to the latest grid status. In this paper, we describe the policies and the specific techniques involved in the batch resizing process. We explain the nuts and bolts of these techniques in order to maximise the resulting benefits of batch processing. We conduct experiments to determine the nature of the policies and techniques in response to a real grid environment. The techniques are further investigated to highlight the important parameters for obtaining the appropriate task granularity for a grid resource. Keywords— Batch Resizing, Task Granularity, Global Grid, Application Turnaround Time
منابع مشابه
Matching Nuts and Bolts Faster
The problem of matching nuts and bolts is the following Given a collection of n nuts of distinct sizes and n bolts such that there is a one to one correspondence between the nuts and the bolts nd for each nut its corresponding bolt We can only compare nuts to bolts That is we can neither compare nuts to nuts nor bolts to bolts This humble restriction on the comparisons appears to make this prob...
متن کاملMatching Nuts and Bolts Extended Abstract
We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of bolts and nuts and wants to nd the corresponding pairs of bolts and nuts. The procedure uses our (and the carpenter's) ability to construct e ciently highly expanding graphs. The problem considered is given a collection of n bolts of distinct widths and n nuts such that there is a 1-1 corresponden...
متن کاملMatching Nuts and Bolts Optimally∗
The nuts and bolts problem is the following : Given a collection of n nuts of distinct sizes and n bolts of distinct sizes such that for each nut there is exactly one matching bolt, find for each nut its corresponding bolt subject to the restriction that we can only compare nuts to bolts. That is we can neither compare nuts to nuts, nor bolts to bolts. This humble restriction on the comparisons...
متن کاملFine-Grain Authorization Policies in the GRID: Design and Implementation
In this paper we describe our work on enabling fine-grain authorization for resource usage and management. We address the need of Virtual Organizations (VOs) to enforce their own polices in addition to those of the resource owners, both in regard to resource consumption and job management. To implement this design we propose changes and extensions to the Globus Toolkit’s version 2 (GT2) resourc...
متن کاملMatching Nuts and Bolts Noga Alon
We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of bolts and nuts and wants to nd the corresponding pairs of bolts and nuts. The procedure uses our (and the carpenter's) ability to construct e ciently highly expanding graphs. The problem considered is given a collection of n bolts of distinct widths and n nuts such that there is a 1-1 corresponden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JIPS
دوره 7 شماره
صفحات -
تاریخ انتشار 2011